package com.echo.boot.leetcode.二叉树;

import com.echo.boot.structure.tree.binarytree.BinarySearchTree;

/**
 * Created with IntelliJ IDEA
 * Created By CQ
 * Date: 2020/5/18
 * Time: 14:09
 */
public class _266_反转二叉树 {

    public static void main(String[] args) {
        Integer[] arr = {7, 4, 2, 1, 3, 5, 9, 8, 11, 10, 12};
        BinarySearchTree<Integer> tree = new BinarySearchTree<>();
        for (int i = 0; i < arr.length; i++) {
            tree.add(i);
        }


        // 反转二叉树
    }


}
